منابع مشابه
Irreversible 2-conversion set in graphs of bounded degree
An irreversible k-threshold process (also a k-neighbor bootstrap percolation) is a dynamic process on a graph where vertices change color from white to black if they have at least k black neighbors. An irreversible k-conversion set of a graph G is a subset S of vertices of G such that the irreversible k-threshold process starting with S black eventually changes all vertices of G to black. We sh...
متن کاملA Note on Irreversible 2-Conversion Sets in Subcubic Graphs
Irreversible k-conversion set is introduced in connection with the mathematical modeling of the spread of diseases or opinions. We show that the problem to find a minimum irreversible 2-conversion set can be solved in O(n2 log6 n) time for graphs with maximum degree at most 3 (subcubic graphs) by reducing it to the graphic matroid parity problem, where n is the number of vertices in a graph. Th...
متن کاملIrreversible quantum graphs
Irreversibility is introduced to quantum graphs by coupling the graphs to a bath of harmonic oscillators. The interaction which is linear in the harmonic oscillator amplitudes is localized at the vertices. It is shown that for sufficiently strong coupling, the spectrum of the system admits a new continuum mode which exists even if the graph is compact, and a single harmonic oscillator is couple...
متن کاملIrreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products
In graph theoretical models of the spread of disease through populations, the spread of opinion through social networks, and the spread of faults through distributed computer networks, vertices are in two states, either black or white, and these states are dynamically updated at discrete time steps according to the rules of the particular conversion process used in the model. This paper conside...
متن کاملIrreversible 2-conversion set is NP-complete
An irreversible k-threshold process is a process on a graph where vertices change color from white to black if they have at least k black neighbors. An irreversible k-conversion set is a subset S of vertices of a graph G such that the irreversible k-threshold process changes all vertices of G to black if S is the initial set of black vertices. We show that deciding the existence of an irreversi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.03.029